Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
نویسندگان
چکیده
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this spirit we investigate two instances of the interpretation method: matrix interpretations and context dependent interpretations. We introduce a subclass of matrix interpretations, denoted as triangular matrix interpretations, which induce polynomial derivational complexity and establish tight correspondence results between a subclass of context dependent interpretations and restricted triangular matrix interpretations. The thus obtained new results are easy to implement and considerably extend the analytic power of existing results. We provide ample numerical data for assessing the viability of the method.
منابع مشابه
Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting Systems
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdiprover3 induce small bounds on the derivational complexity of the considered system. We explain the tool in detail, and give an overview of the employed proof methods.
متن کاملContext Dependent Interpretations
Context-dependent interpretations are a termination proof method developed by Hofbauer in 2001. They extend the interpretations into F-algebras by introducing an additional parameter to the interpretation functions. The additional parameter is changed by the context of the evaluated subterm, thus giving rise to the name “context-dependent interpretations”. They were designed to give good upper ...
متن کاملImproved Matrix Interpretation
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popular approach consists in interpreting terms into a domain equipped with an adequate well-founded ordering. In addition to the usual interpretations: natural numbers or polynomials over integer/rational numbers, the rece...
متن کاملModular Complexity Analysis for Term Rewriting
All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to their restricted power. To overcome this limitation the article introduces a modular framework which allows to infer (polynomial) upper bounds on the complexit...
متن کاملmu-term: a tool for proving termination of rewriting with replacement restrictions
This paper describes mu-term, a tool which can be used to automatically prove termination of computational restrictions of rewriting such as context-sensitive rewriting and lazy rewriting. The tool can also be used to prove termination of rewriting. In this sense, mu-term provides the first implementation of reduction orderings based on polynomial interpretations over the rational numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008